Have I Been Here Before? State Memoization in Temporal Planning
نویسندگان
چکیده
State memoization is critical to the good performance of heuristic forward search planners, which represent a significant proportion of the current state-of-the-art planning approaches. In non-temporal planning it is sufficient to discard any state that has been generated before, regardless of the path taken to reach that state, with the only side-constraint being plan cost. We begin this paper by demonstrating that the use of this technique in temporal planning can lead to loss of optimality with respect to metrics involving makespan and that in the case of more expressive domains can lead to loss of completeness. We identify the specific conditions under which this occurs: states where actions are currently executing. Following from this we introduce new memoization techniques for expressive temporal planning problems that are both completeness and optimality preserving, solving the challenging problem of determining when two states in temporal planning can be considered equivalent. Finally, we demonstrate that these have significant impact on improving the planning performance across a wide range of temporal planning benchmarks in the POPF planning framework.
منابع مشابه
Using Automatic Memoization as a Software Engineering Tool in Real-World AI Systems
Memo functions and memoization are well-known concepts in A I programming. They have been discussed since the Sixties and are ofien used as ezamples in introductory programming texts. However, the automation of memoization as a practical sofiware engineering tool f o r A I systems has not received a detailed treatment. This paper describes how automatic memoization can be made viable on a large...
متن کاملUsing Automatic Memoization as a Software Engineering Tool in Real-world Ai Systems
Memo functions and memoization are well known concepts in AI programming. They have been around since the sixties and are often used as examples in introductory programming texts. However, the automation of memoization as a practical software engineering tool for AI systems has never received a detailed treatment. This paper describes how automatic memoization can be made viable on a large scal...
متن کاملMemoization in Top-Down Parsing
In a paper published in this journal, Norvig (1991) pointed out that memoization of a top-down recognizer program produces a program that behaves similiarly to a chart parser. This is not surprising to anyone familiar with logic-programming approaches to natural language processing (NLP). For example, the Earley deduction proof procedure is essentially a memoizing version of the top-down select...
متن کاملMemoization in Constraint Logic Programming
Motivated by a natural language processing application, this paper shows how to extend memoization techniques for logic programs to constraint logic programming. The lemma table proof procedure presented here generalizes standard memoization proof procedures such as OLDT resolution by (i) allowing goals and constraints to be resolved in any order, (ii) permitting memoization on sets of goals an...
متن کاملAnalysing spatio-temporal autocorrelation with LISTA-Viz
Many interesting analysis problems (for example, disease surveillance) would become more tractable if their spatio-temporal structure was better understood. Specifically, it would be helpful to be able to identify autocorrelation in space and time simultaneously. Some of the most commonly used measures of spatial association are LISA statistics, such as the Local Moran’s I or the Getis-Ord Gi*,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016